Polygons Whose Vertex Triangles Have Equal Area
نویسندگان
چکیده
منابع مشابه
A Triangulation for Optimal Strip Decomposition in Simple Polygons
In computer graphics, most polygonal surfaces are rendered via triangles. Rendering a set of triangles needs the data of the triangle vertices. Since the speed of rendering is bounded by data rate, reducing the amount of data will make rendering faster. This can be attained by ordering triangles so that consecutive triangles share an edge, that is, only one additional vertex need to be transmit...
متن کاملGeometry of pentagons: from Gauss to Robbins
An almost forgotten gem of Gauss tells us how to compute the area of a pentagon by just going around it and measuring areas of each vertex triangles (i.e. triangles whose vertices are three consecutive vertices of the pentagon). We give several proofs and extensions of this beautiful formula to hexagon etc. and consider special cases of affine–regular polygons. The Gauss pentagon formula is, in...
متن کاملVisibility Representations of Complete Graphs
In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the xy-plane. Two vertices are adjacent if and only if the two corresponding polygons see each other i.e. it is possible to construct an abscissa perpendicular to the xy-plane connecting the two polygons and avoiding all the other...
متن کاملEqual Area Polygons in Convex Bodies
In this paper, we consider the problem of packing two or more equal area polygons with disjoint interiors into a convex body K in E such that each of them has at most a given number of sides. We show that for a convex quadrilateral K of area 1, there exist n internally disjoint triangles of equal area such that the sum of their areas is at least 4n 4n+1 . We also prove results for other types o...
متن کاملHinged dissections of polyominoes and polyforms
This paper shows how to hinge together a collection of polygons at vertices in such a way that a single object can be reshaped into any n-omino, for a given value of n. An n-omino is de ned generally as a connected union of n unit squares on the integer grid. Our best dissection uses 2(n 1) polygons. We generalize this result to the connected unions of nonoverlapping equal-size regular k-gons j...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The American Mathematical Monthly
دوره 110 شماره
صفحات -
تاریخ انتشار 2003